0.16/0.17	% Problem    : Vampire---4.8_27974 : TPTP v0.0.0. Released v0.0.0.
0.18/0.18	% Command    : run_E %s %d THM
0.18/0.39	% Computer : n004.cluster.edu
0.18/0.39	% Model    : x86_64 x86_64
0.18/0.39	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.18/0.39	% Memory   : 8042.1875MB
0.18/0.39	% OS       : Linux 3.10.0-693.el7.x86_64
0.18/0.39	% CPULimit   : 1440
0.18/0.39	% WCLimit    : 180
0.18/0.39	% DateTime   : Mon Jul  3 12:56:15 EDT 2023
0.18/0.39	% CPUTime    : 
0.37/0.59	Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974
0.37/0.60	# Version: 3.1pre001-ho
0.45/0.72	# Preprocessing class: HSLMSMSMLLLCHSA.
0.45/0.72	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
0.45/0.72	# Starting pre_casc_4 with 720s (4) cores
0.45/0.72	# Starting full_lambda_6 with 180s (1) cores
0.45/0.72	# Starting sh10 with 180s (1) cores
0.45/0.72	# Starting post_as_ho9 with 180s (1) cores
0.45/0.72	# Starting post_as_ho8 with 180s (1) cores
0.45/0.72	# pre_casc_4 with pid 28153 completed with status 0
0.45/0.72	# Result found by pre_casc_4
0.45/0.72	# Preprocessing class: HSLMSMSMLLLCHSA.
0.45/0.72	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
0.45/0.72	# Starting pre_casc_4 with 720s (4) cores
0.45/0.72	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.45/0.72	# Search class: HGHSM-FSLM31-DHSMMFBN
0.45/0.72	# partial match(2): HGHSM-FSLM31-DHSFFFBN
0.45/0.72	# Scheduled 6 strats onto 4 cores with 720 seconds (720 total)
0.45/0.72	# Starting sh1l with 214s (1) cores
0.45/0.72	# Starting pre_casc_4 with 73s (1) cores
0.45/0.72	# Starting new_bool_8 with 126s (1) cores
0.45/0.72	# Starting new_bool_9 with 125s (1) cores
0.45/0.72	# pre_casc_4 with pid 28160 completed with status 0
0.45/0.72	# Result found by pre_casc_4
0.45/0.72	# Preprocessing class: HSLMSMSMLLLCHSA.
0.45/0.72	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
0.45/0.72	# Starting pre_casc_4 with 720s (4) cores
0.45/0.72	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.45/0.72	# Search class: HGHSM-FSLM31-DHSMMFBN
0.45/0.72	# partial match(2): HGHSM-FSLM31-DHSFFFBN
0.45/0.72	# Scheduled 6 strats onto 4 cores with 720 seconds (720 total)
0.45/0.72	# Starting sh1l with 214s (1) cores
0.45/0.72	# Starting pre_casc_4 with 73s (1) cores
0.45/0.72	# Preprocessing time       : 0.006 s
0.45/0.72	# Presaturation interreduction done
0.45/0.72	
0.45/0.72	# Proof found!
0.45/0.72	# SZS status Theorem
0.45/0.72	# SZS output start CNFRefutation
0.45/0.72	thf(decl_22, type, is_of: $i > ($i > $o) > $o).
0.45/0.72	thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o).
0.45/0.72	thf(decl_25, type, in: $i > $i > $o).
0.45/0.72	thf(decl_61, type, imp: $o > $o > $o).
0.45/0.72	thf(decl_62, type, d_not: $o > $o).
0.45/0.72	thf(decl_67, type, l_or: $o > $o > $o).
0.45/0.72	thf(decl_77, type, e_is: $i > $i > $i > $o).
0.45/0.72	thf(decl_123, type, nat: $i).
0.45/0.72	thf(decl_124, type, n_is: $i > $i > $o).
0.45/0.72	thf(decl_127, type, n_some: ($i > $o) > $o).
0.45/0.72	thf(decl_147, type, diffprop: $i > $i > $i > $o).
0.45/0.72	thf(decl_148, type, d_29_ii: $i > $i > $o).
0.45/0.72	thf(decl_149, type, iii: $i > $i > $o).
0.45/0.72	thf(decl_162, type, n_ts: $i > $i > $i).
0.45/0.72	thf(decl_189, type, frac: $i).
0.45/0.72	thf(decl_191, type, num: $i > $i).
0.45/0.72	thf(decl_192, type, den: $i > $i).
0.45/0.72	thf(decl_193, type, n_eq: $i > $i > $o).
0.45/0.72	thf(decl_194, type, moref: $i > $i > $o).
0.45/0.72	thf(decl_195, type, lessf: $i > $i > $o).
0.45/0.72	thf(decl_196, type, moreq: $i > $i > $o).
0.45/0.72	thf(decl_197, type, lesseq: $i > $i > $o).
0.45/0.72	thf(decl_198, type, esk1_0: $i).
0.45/0.72	thf(decl_199, type, esk2_0: $i).
0.45/0.72	thf(def_d_not, axiom, ((d_not)=(^[X36:$o]:((imp @ ((X36)) @ (~($true)))))), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', def_d_not)).
0.45/0.72	thf(def_imp, axiom, ((imp)=(^[X34:$o, X35:$o]:(((X34)=>(X35))))), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', def_imp)).
0.45/0.72	thf(def_lessf, axiom, ((lessf)=(^[X1:$i, X220:$i]:((iii @ (n_ts @ (num @ X1) @ (den @ X220)) @ (n_ts @ (num @ X220) @ (den @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', def_lessf)).
0.45/0.72	thf(def_iii, axiom, ((iii)=(^[X1:$i, X185:$i]:((n_some @ (diffprop @ X185 @ X1))))), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', def_iii)).
0.45/0.72	thf(def_n_eq, axiom, ((n_eq)=(^[X1:$i, X218:$i]:((n_is @ (n_ts @ (num @ X1) @ (den @ X218)) @ (n_ts @ (num @ X218) @ (den @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', def_n_eq)).
0.45/0.72	thf(def_l_or, axiom, ((l_or)=(^[X42:$o]:(imp @ ((d_not @ ((X42))))))), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', def_l_or)).
0.45/0.72	thf(def_moref, axiom, ((moref)=(^[X1:$i, X219:$i]:((d_29_ii @ (n_ts @ (num @ X1) @ (den @ X219)) @ (n_ts @ (num @ X219) @ (den @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', def_moref)).
0.45/0.72	thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', def_d_29_ii)).
0.45/0.72	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', def_all_of)).
0.45/0.72	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', def_is_of)).
0.45/0.72	thf(def_lesseq, axiom, ((lesseq)=(^[X1:$i, X222:$i]:((l_or @ ((lessf @ X1 @ X222)) @ ((n_eq @ X1 @ X222)))))), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', def_lesseq)).
0.45/0.72	thf(def_n_is, axiom, ((n_is)=(e_is @ nat)), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', def_n_is)).
0.45/0.72	thf(def_moreq, axiom, ((moreq)=(^[X1:$i, X221:$i]:((l_or @ ((moref @ X1 @ X221)) @ ((n_eq @ X1 @ X221)))))), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', def_moreq)).
0.45/0.72	thf(satz48, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X350:$i]:((in @ X350 @ frac))) @ (^[X351:$i]:(((lesseq @ X351 @ X1)<=(moreq @ X1 @ X351)))))))), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', satz48)).
0.45/0.72	thf(satz38, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X469:$i]:((in @ X469 @ frac))) @ (^[X470:$i]:(((n_eq @ X470 @ X1)<=(n_eq @ X1 @ X470)))))))), file('/export/starexec/sandbox2/tmp/tmp.XfWDGfsb9j/Vampire---4.8_27974', satz38)).
0.45/0.72	thf(c_0_15, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_not])).
0.45/0.72	thf(c_0_16, plain, ((imp)=(^[Z0/* 19 */:$o, Z1:$o]:(((Z0)=>(Z1))))), inference(fof_simplification,[status(thm)],[def_imp])).
0.45/0.72	thf(c_0_17, plain, ((lessf)=(^[Z0/* 19 */:$i, Z1:$i]:(((n_some @ (diffprop @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ (n_ts @ (num @ Z0) @ (den @ Z1)))))))), inference(fof_simplification,[status(thm)],[def_lessf])).
0.45/0.72	thf(c_0_18, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((n_some @ (diffprop @ Z1 @ Z0))))), inference(fof_simplification,[status(thm)],[def_iii])).
0.45/0.72	thf(c_0_19, plain, ((n_eq)=(^[Z0/* 19 */:$i, Z1:$i]:((e_is @ nat @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0)))))), inference(fof_simplification,[status(thm)],[def_n_eq])).
0.45/0.72	thf(c_0_20, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(fof_simplification,[status(thm)],[def_l_or])).
0.45/0.72	thf(c_0_21, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_15, c_0_16])).
0.45/0.72	thf(c_0_22, plain, ((moref)=(^[Z0/* 19 */:$i, Z1:$i]:(((n_some @ (diffprop @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0)))))))), inference(fof_simplification,[status(thm)],[def_moref])).
0.45/0.72	thf(c_0_23, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((n_some @ (diffprop @ Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])).
0.45/0.72	thf(c_0_24, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
0.45/0.72	thf(c_0_25, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
0.45/0.72	thf(c_0_26, plain, ((lesseq)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((n_some @ (diffprop @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ (n_ts @ (num @ Z0) @ (den @ Z1))))))))=>(~($true)))))=>(((e_is @ nat @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0)))))))))), inference(fof_simplification,[status(thm)],[def_lesseq])).
0.45/0.72	thf(c_0_27, plain, ((lessf)=(^[Z0/* 19 */:$i, Z1:$i]:(((n_some @ (diffprop @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ (n_ts @ (num @ Z0) @ (den @ Z1)))))))), inference(apply_def,[status(thm)],[c_0_17, c_0_18])).
0.45/0.72	thf(c_0_28, plain, ((n_eq)=(^[Z0/* 19 */:$i, Z1:$i]:((e_is @ nat @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0)))))), inference(apply_def,[status(thm)],[c_0_19, def_n_is])).
0.45/0.72	thf(c_0_29, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20, c_0_16]), c_0_21])).
0.45/0.72	thf(c_0_30, plain, ((moreq)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((n_some @ (diffprop @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0))))))))=>(~($true)))))=>(((e_is @ nat @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0)))))))))), inference(fof_simplification,[status(thm)],[def_moreq])).
0.45/0.72	thf(c_0_31, plain, ((moref)=(^[Z0/* 19 */:$i, Z1:$i]:(((n_some @ (diffprop @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0)))))))), inference(apply_def,[status(thm)],[c_0_22, c_0_23])).
0.45/0.72	thf(c_0_32, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_24, c_0_25])).
0.45/0.72	thf(c_0_33, plain, ((lesseq)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((n_some @ (diffprop @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ (n_ts @ (num @ Z0) @ (den @ Z1))))))))=>(~($true)))))=>(((e_is @ nat @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_26, c_0_27]), c_0_28]), c_0_29])).
0.45/0.72	thf(c_0_34, plain, ((moreq)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((n_some @ (diffprop @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0))))))))=>(~($true)))))=>(((e_is @ nat @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_ts @ (num @ Z1) @ (den @ Z0)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_30, c_0_31]), c_0_28]), c_0_29])).
0.45/0.72	thf(c_0_35, negated_conjecture, ~(![X527:$i]:(((in @ X527 @ frac)=>![X526:$i]:(((in @ X526 @ frac)=>((~(n_some @ (diffprop @ (n_ts @ (num @ X527) @ (den @ X526)) @ (n_ts @ (num @ X526) @ (den @ X527))))=>(e_is @ nat @ (n_ts @ (num @ X527) @ (den @ X526)) @ (n_ts @ (num @ X526) @ (den @ X527))))=>(~(n_some @ (diffprop @ (n_ts @ (num @ X527) @ (den @ X526)) @ (n_ts @ (num @ X526) @ (den @ X527))))=>(e_is @ nat @ (n_ts @ (num @ X526) @ (den @ X527)) @ (n_ts @ (num @ X527) @ (den @ X526)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz48])]), c_0_32]), c_0_33]), c_0_34])])).
0.45/0.72	thf(c_0_36, plain, ![X558:$i]:(((in @ X558 @ frac)=>![X557:$i]:(((in @ X557 @ frac)=>((e_is @ nat @ (n_ts @ (num @ X558) @ (den @ X557)) @ (n_ts @ (num @ X557) @ (den @ X558)))=>(e_is @ nat @ (n_ts @ (num @ X557) @ (den @ X558)) @ (n_ts @ (num @ X558) @ (den @ X557)))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz38]), c_0_32]), c_0_28])])).
0.45/0.72	thf(c_0_37, negated_conjecture, ((in @ esk1_0 @ frac)&((in @ esk2_0 @ frac)&(((n_some @ (diffprop @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0))))|(e_is @ nat @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0))))&(~(n_some @ (diffprop @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0))))&~(e_is @ nat @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0)) @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0))))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])).
0.45/0.72	thf(c_0_38, plain, ![X892:$i, X893:$i]:((~(in @ X892 @ frac)|(~(in @ X893 @ frac)|(~(e_is @ nat @ (n_ts @ (num @ X892) @ (den @ X893)) @ (n_ts @ (num @ X893) @ (den @ X892)))|(e_is @ nat @ (n_ts @ (num @ X893) @ (den @ X892)) @ (n_ts @ (num @ X892) @ (den @ X893))))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])).
0.45/0.72	thf(c_0_39, negated_conjecture, ((n_some @ (diffprop @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0))))|(e_is @ nat @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_37])).
0.45/0.72	thf(c_0_40, negated_conjecture, ~((n_some @ (diffprop @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0))))), inference(split_conjunct,[status(thm)],[c_0_37])).
0.45/0.72	thf(c_0_41, plain, ![X4:$i, X1:$i]:(((e_is @ nat @ (n_ts @ (num @ X4) @ (den @ X1)) @ (n_ts @ (num @ X1) @ (den @ X4)))|~((in @ X1 @ frac))|~((in @ X4 @ frac))|~((e_is @ nat @ (n_ts @ (num @ X1) @ (den @ X4)) @ (n_ts @ (num @ X4) @ (den @ X1)))))), inference(split_conjunct,[status(thm)],[c_0_38])).
0.45/0.72	thf(c_0_42, negated_conjecture, (e_is @ nat @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0))), inference(sr,[status(thm)],[c_0_39, c_0_40])).
0.45/0.72	thf(c_0_43, negated_conjecture, (in @ esk2_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_37])).
0.45/0.72	thf(c_0_44, negated_conjecture, (in @ esk1_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_37])).
0.45/0.72	thf(c_0_45, negated_conjecture, ~((e_is @ nat @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0)) @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_37])).
0.45/0.72	thf(c_0_46, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_42]), c_0_43]), c_0_44])]), c_0_45]), ['proof']).
0.45/0.72	# SZS output end CNFRefutation
0.45/0.72	# Parsed axioms                        : 562
0.45/0.72	# Removed by relevancy pruning/SinE    : 395
0.45/0.72	# Initial clauses                      : 209
0.45/0.72	# Removed in clause preprocessing      : 6
0.45/0.72	# Initial clauses in saturation        : 203
0.45/0.72	# Processed clauses                    : 391
0.45/0.72	# ...of these trivial                  : 1
0.45/0.72	# ...subsumed                          : 110
0.45/0.72	# ...remaining for further processing  : 280
0.45/0.72	# Other redundant clauses eliminated   : 12
0.45/0.72	# Clauses deleted for lack of memory   : 0
0.45/0.72	# Backward-subsumed                    : 8
0.45/0.72	# Backward-rewritten                   : 0
0.45/0.72	# Generated clauses                    : 774
0.45/0.72	# ...of the previous two non-redundant : 720
0.45/0.72	# ...aggressively subsumed             : 0
0.45/0.72	# Contextual simplify-reflections      : 7
0.45/0.72	# Paramodulations                      : 734
0.45/0.72	# Factorizations                       : 0
0.45/0.72	# NegExts                              : 0
0.45/0.72	# Equation resolutions                 : 13
0.45/0.72	# Total rewrite steps                  : 129
0.45/0.72	# Propositional unsat checks           : 0
0.45/0.72	#    Propositional check models        : 0
0.45/0.72	#    Propositional check unsatisfiable : 0
0.45/0.72	#    Propositional clauses             : 0
0.45/0.72	#    Propositional clauses after purity: 0
0.45/0.72	#    Propositional unsat core size     : 0
0.45/0.72	#    Propositional preprocessing time  : 0.000
0.45/0.72	#    Propositional encoding time       : 0.000
0.45/0.72	#    Propositional solver time         : 0.000
0.45/0.72	#    Success case prop preproc time    : 0.000
0.45/0.72	#    Success case prop encoding time   : 0.000
0.45/0.72	#    Success case prop solver time     : 0.000
0.45/0.72	# Current number of processed clauses  : 148
0.45/0.72	#    Positive orientable unit clauses  : 28
0.45/0.72	#    Positive unorientable unit clauses: 0
0.45/0.72	#    Negative unit clauses             : 7
0.45/0.72	#    Non-unit-clauses                  : 113
0.45/0.72	# Current number of unprocessed clauses: 652
0.45/0.72	# ...number of literals in the above   : 3920
0.45/0.72	# Current number of archived formulas  : 0
0.45/0.72	# Current number of archived clauses   : 132
0.45/0.72	# Clause-clause subsumption calls (NU) : 17909
0.45/0.72	# Rec. Clause-clause subsumption calls : 3984
0.45/0.72	# Non-unit clause-clause subsumptions  : 117
0.45/0.72	# Unit Clause-clause subsumption calls : 46
0.45/0.72	# Rewrite failures with RHS unbound    : 0
0.45/0.72	# BW rewrite match attempts            : 5
0.45/0.72	# BW rewrite match successes           : 0
0.45/0.72	# Condensation attempts                : 0
0.45/0.72	# Condensation successes               : 0
0.45/0.72	# Termbank termtop insertions          : 85372
0.45/0.72	
0.45/0.72	# -------------------------------------------------
0.45/0.72	# User time                : 0.087 s
0.45/0.72	# System time              : 0.015 s
0.45/0.72	# Total time               : 0.102 s
0.45/0.72	# Maximum resident set size: 6404 pages
0.45/0.72	
0.45/0.72	# -------------------------------------------------
0.45/0.72	# User time                : 0.235 s
0.45/0.72	# System time              : 0.042 s
0.45/0.72	# Total time               : 0.277 s
0.45/0.72	# Maximum resident set size: 2732 pages
0.45/0.72	% E---3.1 exiting
0.45/0.72	EOF